The integrity of small cage graphs

نویسندگان

  • Mustafa Atici
  • Robert Crawford
  • Claus Ernst
چکیده

Integrity, a measure of network reliability, is defined as I(G) = minS⊂V {|S|+m(G− S)} , where G is a graph with vertex set V and m(G−S) denotes the order of the largest component of G− S. In this article the integrity of the cubic cage graphs (3, g) up to g = 10 and the integrity of the known small cages with less than or equal to 60 vertices is computed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tenacity and some other Parameters of Interval Graphs can be computed in polynomial time

In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of interval graphs are polynomial. In this paper, two different vulnerability parameters of graphs, tenacity and rupture degree are defined. In general, computing the tenacity o...

متن کامل

A Survey on Complexity of Integrity Parameter

Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. In this paper we discuss Integrity and its properties in vulnerability calculation. The integrity of a graph G, I(G), is defined t...

متن کامل

Matching Integral Graphs of Small Order

In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...

متن کامل

On the tenacity of cycle permutation graph

A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.

متن کامل

Impact of Atlantic salmon cage culture on sediment chemistry in Mjoifjordur, Iceland

Impact of Atlantic salmon (Salmo salar) cage culture in Mjoifjordur, Eastern Iceland on the chemistry of the sediment was investigated. Sediment samples were collected using a Shipek grab in December 2003. A core sub-sample was taken from each grab for analyzing total organic matter, total organic carbon, total nitrogen and phosphorus in different depths from three stations at various distances...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 43  شماره 

صفحات  -

تاریخ انتشار 2009